Non-reducible Descriptions for Conditional Kolmogorov Complexity

نویسندگان

  • Andrej Muchnik
  • Alexander Shen
  • Nikolai K. Vereshchagin
  • Michael V. Vyugin
چکیده

Assume that a program p on input a outputs b. We are looking for a shorter program q having the same property (q(a) = b). In addition, we want q to be simple conditional to p (this means that the conditional Kolmogorov complexity K (q|p) is negligible). In the present paper, we prove that sometimes there is no such program q, even in the case when the complexity of p is much bigger than K (b|a). We give three different constructions that use the game approach, probabilistic arguments and algebraic arguments, respectively. 1 Definitions and statements Let a and b be binary strings. Consider programs p such that p(a) = b (the program p on input a outputs b). What is the minimal length of such a program? If the programming language is chosen appropriately, this length is close to K (b|a), the conditional Kolmogorov complexity of b given a. We will ignore additive terms of order O(log n) where n is the maximum length of the strings involved. With this precision all the versions of Kolmogorov complexity (the plain one, the prefix one etc.) coincide. For the definition of Kolmogorov complexity K (b) and K (b|a) we refer to the textbook [2]. To avoid references to a specific programming language we will consider “descriptions” instead of programs. A string p is called a conditional description of a string b given a if ∗Institute of New Technologies; e-mail: [email protected]. The work was supported by RFBR grants 04-01-00427, 06-01-00122a. †The work was supported by CNRS (LIF, Marseille, France; Poncelet laboratory, Moscow), STINT foundation, Uppsala university (Sweden), Royal Holloway College (UK), RFBR (grants 02-01-22001, 03-01-00475, 06-01-00122a) and Scientific schools supporting council (grant NSh-358.2003.1); e-mail: [email protected], [email protected]. ‡Moscow State University, e-mail: [email protected]. The work was supported in part by the RFBR grants 02-01-22001, 03-01-00475, 06-01-00122a, NSh-358.2003.1. §Moscow State University, e-mail: [email protected]. The work was supported in part by the RFBR grants 02-01-22001, 03-01-00475, 06-01-00122a, NSh-358.2003.1. ¶Moscow State University, e-mail: [email protected], [email protected]. The work was supported in part by the RFBR grants 02-01-22001, 03-01-00475, 06-01-00122a, NSh-358.2003.1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Curiouser and Curiouser: The Link between Incompressibility and Complexity

This talk centers around some audacious conjectures that attempt to forge firm links between computational complexity classes and the study of Kolmogorov complexity. More specifically, let R denote the set of Kolmogorov-random strings. Let BPP denote the class of problems that can be solved with negligible error by probabilistic polynomial-time computations, and let NEXP denote the class of pro...

متن کامل

ar X iv : 0 90 4 . 31 16 v 1 [ cs . C C ] 2 0 A pr 2 00 9 Variations on Muchnik ’ s Conditional Complexity Theorem ⋆

Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length and is simple conditional on b. In this paper we present two new proofs of this theorem. The first one is based on the on-line matching algorithm for bipartite graphs. The second one, based on extractors, can be general...

متن کامل

On Languages with Very High Information Content

The main result of this paper is the following: Any language in ESPACE that is bounded truthtable reducible in polynomial time to a set with very high space-bounded Kolmogorov complexity must be bounded truth-table reducible in polynomial time to a sparse set.

متن کامل

What Can be Efficiently Reduced to the Kolmogorov-Random Strings?

We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings RC. We show that this question cannot be posed without explicitly dealing with issues raised by the choice of universal machine in the definition of Kolmogorov complexity. Among other results, we show that although for ...

متن کامل

Information-geometric approach to inferring causal directions

While conventional approaches to causal inference are mainly based on conditional (in)dependences, recent methods also account for the shape of (conditional) distributions. The idea is that the causal hypothesis “X causes Y ” imposes that the marginal distribution PX and the conditional distribution PY |X represent independent mechanisms of nature. Recently it has been postulated that the short...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 384  شماره 

صفحات  -

تاریخ انتشار 2004